On sequences defined by D0L power series

On D0L power series

We study D0L power series. We show how elementary morphisms introduced by Ehrenfeucht and Rozenberg can be used in connection with power series, characterize the sequences of rational numbers and integers which can be appear as coe cients in D0L power series and establish various decidability results. TUCS Research Group Mathematical Structures of Computer Science

On algebraicness of D0L power series

We show that it is decidable whether or not a given D0L power series over a semiring A is A-algebraic in case A = Q+ or A = N. The proof relies heavily on the use of elementary morphisms in a power series framework and gives also a new method to decide whether or not a given D0L language is context-free. Category: F4.3

On Formal Power Series Generated by Lindenmayer Systems

To study power series generated by Lindenmayer systems we de ne L algebraic systems and series over arbitrary commutative semirings. We establish closure and xed point properties of L algebraic series. We show how the framework of L algebraic series can be used to de ne D0L, 0L, E0L, DT0L, T0L and ET0L power series. We generalize for power series the classical result stating that D0L languages ...

The Equivalence Problem for DF0L Languages and Power Series

The theory of free monoids lies at the crossroads of mathematics and theoretical computer science. Many problems studied in free monoid theory have their origins in theoretical computer science. On the other hand, their solutions often require deep methods from classical mathematics. D0L systems constitute a very natural framework for studying free monoid morphisms and their iterations. Infinit...

On images of D0L and DT0L power series